Lecture 5 – February 17 , 2016
نویسندگان
چکیده
This lecture is on dimensionality reduction, which aims at ‘squashing’ down the dimensionality while still preserving some geometric properties. The motivation behind this technique is that many types of data are high-dimensional, and it will be operationally much easier to manipulate these data in a lower dimension. For instance, the bag-of-words representation of documents, which treats every document as a vector of word counts, can easily have tens of thousands of dimensions. In domains where images or videos are the subjects of interest, the dimension is even greater.
منابع مشابه
Math 140a: Foundations of Real Analysis I
1. Ordered Sets, Ordered Fields, and Completeness 1 1.1. Lecture 1: January 5, 2016 1 1.2. Lecture 2: January 7, 2016 4 1.3. Lecture 3: January 11, 2016 7 1.4. Lecture 4: January 14, 2014 9 2. Sequences and Limits 13 2.1. Lecture 5: January 19, 2016 13 2.2. Lecture 6: January 21, 2016 15 2.3. Lecture 7: January 26, 2016 18 2.4. Lecture 8: January 28, 2016 21 3. Extensions of R: the Extended Rea...
متن کاملRandomized LU Decomposition
Article history: Received 20 February 2015 Received in revised form 17 April 2016 Accepted 29 April 2016 Available online 5 May 2016 Communicated by Thomas Strohmer
متن کاملOptimizing budget allocation for center and median points
Article history: Received 9 August 2015 Received in revised form 3 February 2016 Accepted 12 February 2016 Available online 17 February 2016 Communicated by A. Marchetti-Spaccamela
متن کاملLecture 5 — 10 February, 2014: ``5. Properties of the Lasserre Relaxation.''
http://www.csc.kth.se/~lauria/sos14/ Disclaimer: this lecture note has not yet been reviewed by the main lecturer. It is released as it is for the convenience of the students. In this lecture, we study the properties of the solution vectors of the Lasserre relaxation. We start with some basic properties of the solutions, and then continue to show that the solution vectors give us a family of lo...
متن کاملLecture 17 : Maximum Flow and Minimum Cut
Last lecture we studied duality of linear programs (LP), specifically how to construct the dual, the relation between the optimum of an LP and its dual, and some duality applications. In this lecture, we will talk about another application of duality to prove one of the theorems in combinatorics so called Maximum Flow-Minimum Cut Problem. The theorem roughly says that in any graph, the value of...
متن کامل